import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;

public class test {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int k = scan.nextInt();
        int[] arr = new int[k];
        for (int i = 0; i < arr.length; i++) {
            arr[i] = scan.nextInt();
        }
        boolean flag = false;
        int cnt = 0;
        for (int i = 0; i < arr.length - 1; i++) {
            if(arr[i] % 2 != 0 && arr[i+1] % 2 != 0){
                cnt++;
                if (cnt == 2){
                    flag = true;
                    System.out.println("存在");
                    break;
                }
            }
            else {
                cnt = 0;
            }
        }
        if(flag == false){
            System.out.println("不存在");
        }
    }
//    public static int N = 100010;
//    public static int[] temp = new int[N];
//
//    public static void mergeSort(int[] arr, int l, int r) {
//        if (l >= r) {
//            return;
//        }
//        int mid = (l + r) >> 1;
//        mergeSort(arr, l, mid);
//        mergeSort(arr, mid + 1, r);
//        int i = l, j = mid + 1;
//        int k = 0;
//        while (i <= mid && j <= r) {
//            if (arr[i] < arr[j]) {
//                temp[k++] = arr[i++];
//            } else {
//                temp[k++] = arr[j++];
//            }
//        }
//        while (i <= mid) {
//            temp[k++] = arr[i++];
//        }
//        while (j <= r) {
//            temp[k++] = arr[j++];
//        }
//        for (i = l, j = 0; i <= r; i++, j++) {
//            arr[i] = temp[j];
//        }
//    }
//    public static void main(String[] args) {
//        Scanner scan = new Scanner(System.in);
//        int k = scan.nextInt();
//        int[] arr = new int[k];
//        for (int i = 0; i < arr.length; i++) {
//            arr[i] = scan.nextInt();
//        }
//        mergeSort(arr, 0, arr.length - 1);
//        int cnt = 0;
//        for (int i = 1; i < arr.length; i++) {
//            if(arr[i] == arr[i-1]){
//                cnt++;
//            }
//            else {
//                cnt = 0;
//            }
//            if(cnt >= (arr.length >> 1) - 1){
//                System.out.println(arr[i-1]);
//                cnt = 0;
//            }
//        }
//    }

    public static void main5(String[] args) {
        int[] arr = new int[9];
        Scanner scan = new Scanner(System.in);
        for (int i = 0; i < arr.length; i++) {
            arr[i] = scan.nextInt();
        }
        int ret = 0;
        for (int i = 0; i < arr.length; i++) {
            ret ^= arr[i];
        }
        System.out.println(ret);
    }

    public static void main4(String[] args) {
        int[] arr = new int[]{1, 5, 9, 3, 7, 8, 6, 4, 2, 10};
        Scanner scan = new Scanner(System.in);
        int target = scan.nextInt();
        for (int i = 0; i < arr.length; i++) {
            for (int j = 0; j < arr.length - 1; j++) {
                if (arr[i] + arr[j] == target) {
                    int[] ret = new int[2];
                    ret[0] = i;
                    ret[1] = j;
                    System.out.println(Arrays.toString(ret));
                }
            }
        }
    }

    public static void main3(String[] args) {
        int[] arr = new int[]{5, 6, 8, 4, 2, 7, 9, 3, 1, 10};
        for (int i = 0; i < arr.length - 1; i++) {
            int flag = 0;
            for (int j = 0; j < arr.length - 1 - i; j++) {
                if (arr[j] > arr[j + 1]) {
                    flag = 1;
                    int temp = arr[j];
                    arr[j] = arr[j + 1];
                    arr[j + 1] = temp;
                }
            }
            if (flag == 0) {
                break;
            }
        }
        System.out.println(Arrays.toString(arr));
    }

    public static void main2(String[] args) {
        int[] arr = new int[]{1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
        int left = 0;
        int right = arr.length - 1;
        Scanner scan = new Scanner(System.in);
        int k = scan.nextInt();
        while (left < right) {
            int mid = (left + right) >> 1;
            if (arr[mid] > k) {
                right = mid - 1;
            } else if (arr[mid] < k) {
                left = mid + 1;
            } else {
                System.out.println("找到了下标是" + (k - 1));
                break;
            }
        }


    }

    public static void main1(String[] args) {
        Scanner scan = new Scanner(System.in);
        int k = scan.nextInt();
        int[] arr = new int[k];
        for (int i = 0; i < arr.length; i++) {
            arr[i] = scan.nextInt();
        }
        int l = -1, r = arr.length;
        while (l < r) {
            do {
                l++;
            } while (arr[l] % 2 != 0);
            do {
                r--;
            } while (arr[r] % 2 == 0);
            if (l < r) {
                int temp = arr[l];
                arr[l] = arr[r];
                arr[r] = temp;
            }
        }
        System.out.println(Arrays.toString(arr));
    }
}
